Estimating Temporal Exponential Random Graph Models by Bootstrapped Pseudolikelihood
نویسندگان
چکیده
This package vignette is designed as a hands-on tutorial for estimating temporal exponential random graph models (TERGMs) (Desmarais and Cranmer 2010, 2012b; Hanneke et al. 2010) and assessing goodness of fit and predictive performance (Cranmer and Desmarais 2011; Leifeld and Cranmer 2014) using the xergm package (Leifeld et al. 2014) for the statistical computing environment R (R Core Team 2014). The xergm package is compatible with the syntax of statnet (Handcock et al. 2008; Goodreau et al. 2008; Morris et al. 2008) and uses some of its functions, particularly from the ergm package (Hunter et al. 2008) and the network package (Butts 2008). A basic familiarity with ERGMs and their estimation, as in ergm, and network data management, as in statnet, is assumed and thus not treated extensively in this tutorial. Throughout the examples provided below, a dataset collected by Andrea Knecht on the dynamics of adolescent friendship networks in a Dutch school class is used as an illustration (Knecht 2006, 2008; Knecht et al. 2010; Steglich and Knecht 2009). This dataset is delivered with the xergm package and is the classic textbook example for estimating stochastic actor-oriented models (SAOM) using SIENA and RSiena (Ripley et al. 2011; Snijders et al. 2010).
منابع مشابه
Efficient Bayesian inference for exponential random graph models by correcting the pseudo-posterior distribution
Exponential random graph models are an important tool in the statistical analysis of data. However, Bayesian parameter estimation for these models is extremely challenging, since evaluation of the posterior distribution typically involves the calculation of an intractable normalizing constant. This barrier motivates the consideration of tractable approximations to the likelihood function, such ...
متن کاملA comparison of various approaches to the exponential random graph model: A reanalysis of 102 student networks in school classes
This paper describes an empirical comparison of four specifications of the exponential family of random graph models (ERGM), distinguished by model specification (dyadic independence, Markov, partial conditional dependence) and, for the Markov model, by estimation method (Maximum Pseudolikelihood, Maximum Likelihood). This was done by reanalyzing 102 student networks in 57 junior high school cl...
متن کاملExponential random graph models for affiliation networks
Statistical modeling of social networks as complex systems has always been and remains a challenge for social scientists. Exponential family models give us a convenient way of expressing local network structures that have sufficient statistics for their corresponding parameters. This kind of model, known as Exponential Random Graph Models (ERGMs), or p∗ models, have been developed since the 198...
متن کاملLocal dependence in random graph models: characterization, properties and statistical inference.
Dependent phenomena, such as relational, spatial and temporal phenomena, tend to be characterized by local dependence in the sense that units which are close in a well-defined sense are dependent. In contrast with spatial and temporal phenomena, though, relational phenomena tend to lack a natural neighbourhood structure in the sense that it is unknown which units are close and thus dependent. O...
متن کاملTractable and Consistent Random Graph Models
We define a general class of network formation models, Statistical Exponential Random Graph Models (SERGMs), that nest standard exponential random graph models (ERGMs) as a special case. We provide the first general results on when these models’ (including ERGMs) parameters estimated from the observation of a single network are consistent (i.e., become accurate as the number of nodes grows). Ne...
متن کامل